Parallel Approximation Schemes for problems on planar graphs
نویسندگان
چکیده
منابع مشابه
Approximation Schemes for Planar Graph Problems
Many NP-hard graph problems become easier to approximate on planar graphs and their generalizations. (A graph is planar if it can be drawn in the plane (or the sphere) without crossings. For definitions of other related graph classes, see the entry on Bidimensionality (2004; Demaine, Fomin, Hajiaghayi, Thilikos).) For example, maximum independent set asks to find a maximum subset of vertices in...
متن کاملOptimal Parallel Algorithms for Path Problems on Planar Graphs
Given a biconnected planar graph G and a pair of vertices s and t, the two disjoint problem asks to find a pair of internally disjoint paths from s to t. We present a simple and efficient parallel algorithm for the same. Our algorithm uses the notion of bridges in a novel way and this results in a more elegant and simple algorithm than the existing one. The all-bidirectionaledges (ABE) problem ...
متن کاملPrimal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
A b s t r a c t . Given a subset of cycles of a graph, we consider the problem of finding a minimum-weight set of vertices that meets all cycles in the subset. This problem generalizes a number of problems, including the minlmum-weight feedback vertex set problem in both directed and undirected graphs, the subset feedback vertex set problem, and the graph bipartization problem~ in which one mus...
متن کاملApproximation Schemes for Scheduling on Parallel Machines
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which the resulting scheduling problems possess a polynomial time approximation scheme. Our result cont...
متن کاملOn efficient polynomial-time approximation schemes for problems on planar structures
This work examines the existence of efficient polynomial-time approximation schemes (EPTAS) for a variety of problems contained in the syntactic classes Planar TMIN, Planar TMAX, and Planar MPSAT as defined by Khanna and Motwani. Based on the recent work of Alber, Bodlaender, Fernau and Niedermeier and others, we describe subclasses of problems from Planar TMIN, Planar TMAX, and Planar MPSAT th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1996
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s002360050049